Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search
نویسندگان
چکیده
منابع مشابه
Solving Markov Decision Problems Using Heuristic Search
We describe a heuristic search algorithm for Markov decision problems, called LAO*, that is derived from the classic heuristic search algorithm AO*. LAO* shares the advantage heuristic search has over dynamic programming for simpler classes of problems: it can find optimal solutions without evaluating all problem states. The derivation of LAO* from AO* makes it easier to generalize refinements ...
متن کاملMinimizing Writes in Parallel External Memory Search
Recent research on external-memory search has shown that disks can be effectively used as secondary storage when performing large breadthfirst searches. We introduce the Write-Minimizing Breadth-First Search (WMBFS) algorithm which is designed to minimize the number of writes performed in an external-memory BFS. WMBFS is also designed to store the results of the BFS for later use. We present th...
متن کاملSolving the Top-K Problem with Fixed-Memory Heuristic Search
The Top-K problem is defined as follows. Given L lists of real numbers, find the top K scoring L-tuples. A tuple is scored by the sum of its components. Rare event modeling and event ranking are often reduced to the Top-K problem. In this paper, we present the application of a fixedmemory heuristic search algorithm (namely, SMA*) and its distributed-memory extension to the Top-K problem. Our ap...
متن کاملParallel Heuristic Search
SYNCHEM is a large expert system in the domain of organic chemistry. It finds synthetic pathways by chaining backwards from the target molecule to available compounds. SYNCHEM uses heuristic search to explore the solution space efficiently. Depending on the complexity of the target compound, the system currently takes from a few hours to several days.to solve an interesting problem using the pr...
متن کاملParallel Meta-Heuristic Search
We present a general picture of the parallel meta-heuristic search for optimization. We recall the main concepts and strategies in designing parallel metaheuristics, pointing to a number of contributions that instantiated them for neighborhoodand populationbased meta-heuristics, and identify trends and promising research directions. We focus on cooperation-based strategies, which display remark...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2018
ISSN: 1076-9757
DOI: 10.1613/jair.1.11209